Multidimensional Fast Gauss Transforms by Chebyshev Expansions

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multidimensional Fast Gauss Transforms by Chebyshev Expansions

A new version of the fast Gauss transform (FGT) is introduced which is based on a truncated Chebyshev series expansion of the Gaussian. Unlike the traditional fast algorithms, the scheme does not subdivide sources and evaluation points into multiple clusters. Instead, the whole problem geometry is treated as a single cluster. Estimates for the error as a function of the dimension d and the expa...

متن کامل

Dual-Tree Fast Gauss Transforms

Kernel density estimation (KDE) is a popular statistical technique for estimating the underlying density distribution with minimal assumptions. Although they can be shown to achieve asymptotic estimation optimality for any input distribution, cross-validating for an optimal parameter requires significant computation dominated by kernel summations. In this paper we present an improvement to the ...

متن کامل

The Chebyshev fast Gauss and nonuniform fast Fourier transforms and their application to the evaluation of distributed heat potentials

We present a method for the fast and accurate computation of distributed (or volume) heat potentials in two dimensions. The distributed source is assumed to be given in terms of piecewise space-time Chebyshev polynomials. We discretize uniformly in time, whereas in space the polynomials are defined on the leaf nodes of a quadtree data structure. The quadtree can vary at each time step. We combi...

متن کامل

Fast Gauss transforms with complex parameters using NFFTs

at the target knots yj ∈ [−14 , 1 4 ], j = 1, . . . ,M , where σ = a + ib, a > 0, b ∈ R denotes a complex parameter. Fast Gauss transforms for real parameters σ were developed, e.g., in [15, 8, 9]. In [12], we have specified a more general fast summation algorithm for the Gaussian kernel. Recently, a fast Gauss transform for complex parameters σ with arithmetic complexity O(N log N + M) was int...

متن کامل

Chebyshev transforms on Okounkov bodies

LetL be a big holomorphic line bundle on a compact complex manifoldX.We show how to associate a convex function on the Okounkov body ofL to any continuous metric e−ψ on L.We will call this the Chebyshev transform of ψ, denoted by c[ψ]. Our main theorem states that the integral of the difference of the Chebyshev transforms of two weights is equal to the relative energy of the weights, which is a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SIAM Journal on Scientific Computing

سال: 2009

ISSN: 1064-8275,1095-7197

DOI: 10.1137/080732729